Random complex zeroes, I. Asymptotic normality
نویسندگان
چکیده
منابع مشابه
Moderate deviations for random fields and random complex zeroes
Moderate deviations for random complex zeroes are deduced from a new theorem on moderate deviations for random fields.
متن کاملASYMPTOTIC NORMALITY OF THE k-CORE IN RANDOM GRAPHS
We study the k-core of a random (multi)graph on n vertices with a given degree sequence. In our previous paper [18] we used properties of empirical distributions of independent random variables to give a simple proof of the fact that the size of the giant k-core obeys a law of large numbers as n → ∞. Here we develop the method further and show that the fluctuations around the deterministic limi...
متن کاملAsymptotic Normality of Kernel Type Density Estimators for Random Fields
Kernel type density estimators are studied for random fields. It is proved that the estimators are asymptotically normal if the set of locations of observations become more and more dense in an increasing sequence of domains. It turns out that in our setting the covariance structure of the limiting normal distribution can be a combination of those of the continuous parameter and the discrete pa...
متن کاملAsymptotic Normality of the K - Core in Random Graphs 3
We study the k-core of a random (multi)graph on n vertices with a given degree sequence. In our previous paper [Random Structures Algorithms 30 (2007) 50–62] we used properties of empirical distributions of independent random variables to give a simple proof of the fact that the size of the giant k-core obeys a law of large numbers as n →∞. Here we develop the method further and show that the f...
متن کاملMonotonicity, asymptotic normality and vertex degrees in random graphs
We exploit a result by Nerman [23] which shows that conditional limit theorems hold when a certain monotonicity condition is satisfied. Our main result is an application to vertex degrees in random graphs where we obtain asymptotic normality for the number of vertices with a given degree in the random graph G(n, m) with a fixed number of edges from the corresponding result for the random graph ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Israel Journal of Mathematics
سال: 2004
ISSN: 0021-2172
DOI: 10.1007/bf02984409